Appendix: Active Positive Semidefinite Matrix Completion: Algorithms, Theory and Applications
ثبت نشده
چکیده
We provide proofs that were skipped in the main paper. We also provide some additional experimental results and related work concerning multi-armed bandits that was skipped in the main paper.
منابع مشابه
Active Positive Semidefinite Matrix Completion: Algorithms, Theory and Applications
We provide proofs that were skipped in the main paper. We also provide some additional experimental results and related work concerning multi-armed bandits that was skipped in the main paper.
متن کاملChordal Graphs and Semidefinite Optimization
Chordal graphs play a central role in techniques for exploiting sparsity in large semidefinite optimization problems and in related convex optimization problems involving sparse positive semidefinite matrices. Chordal graph properties are also fundamental to several classical results in combinatorial optimization, linear algebra, statistics, signal processing, machine learning, and nonlinear op...
متن کاملParallel Primal-dual Interior-point Methods for Semidefinite Programs B-415 Parallel Primal-dual Interior-point Methods for Semidefinite Programs
The Semidefinite Program (SDP) is a fundamental problem in mathematical programming. It covers a wide range of applications, such as combinatorial optimization, control theory, polynomial optimization, and quantum chemistry. Solving extremely large-scale SDPs which could not be solved before is a significant work to open up a new vista of future applications of SDPs. Our two software packages S...
متن کاملDecomposition Methods for Sparse Matrix Nearness Problems
We discuss three types of sparse matrix nearness problems: given a sparse symmetric matrix, find the matrix with the same sparsity pattern that is closest to it in Frobenius norm and (1) is positive semidefinite, (2) has a positive semidefinite completion, or (3) has a Euclidean distance matrix completion. Several proximal splitting and decomposition algorithms for these problems are presented ...
متن کاملPositive Semidefinite Matrix Completions on Chordal Graphs and Constraint Nondegeneracy in Semidefinite Programming
Let G = (V, E) be a graph. In matrix completion theory, it is known that the following two conditions are equivalent: (i) G is a chordal graph; (ii) Every G-partial positive semidefinite matrix has a positive semidefinite matrix completion. In this paper, we relate these two conditions to constraint nondegeneracy condition in semidefinite programming and prove that they are each equivalent to (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017